On Some Saddle Point Matrices and Applications to Completely Mixed Equilibrium in Bimatrix Games
نویسندگان
چکیده
Introduction The first part of the paper presents several properties of saddle point matrices with two vector blocks. In these block matrices, the top-left block is a real square matrix , the topright block is the column vector with all entries , the bottom-left block is transposed, and the bottom-right block has the single entry . If is symmetric, the saddle point matrix can be interpreted as the bordered Hessian of a standard quadratic program over the standard simplex and it is usually called the Karush-Kuhn-Tucker matrix of the program. For a review of the many applications of such matrices, see [3].
منابع مشابه
Minimal and locally minimal games and game forms
By Shapley’s (1964) theorem, a matrix game has a saddle point whenever each of its 2 × 2 subgames have one. In other words, all minimal saddle point free (SP-free) matrices are of size 2 × 2. We strengthen this result and show that all locally minimal SP-free matrices are of size 2× 2. In other words, if A is a SP-free matrix in which a saddle point appears after deleting an arbitrary row or co...
متن کاملA Geometric-Combinatorial Approach to Index and Stability in Bimatrix Games
This thesis provides a new geometric-combinatorial construction to characterise the Nash equilibria of a non-degenerate bimatrix game and their indices. Considering a non-degenerate m× n bimatrix game, the construction yields an (m− 1)-simplex X4 that is simplicially divided into (m−1)-simplices, reflecting the best reply structure of player II. Each (m− 1)-simplex in the triangulation is divid...
متن کاملApproximate and Well-supported Approximate Nash Equilibria of Random Bimatrix Games
We focus on the problem of computing approximate Nash equilibria and well-supported approximate Nash equilibria in random bimatrix games, where each player's payoffs are bounded and independent random variables, not necessarily identically distributed, but with common expectations. We show that the completely mixed uniform strategy profile, i.e. the combination of mixed strategies (one per play...
متن کاملApproximation of Isomorphic Infinite Two-Person Non-Cooperative Games by Variously Sampling the Players' Payoff Functions and Reshaping Payoff Matrices into Bimatrix Game
Approximation in solving the infinite two-person non-cooperative games is studied in the paper. An approximation approach with conversion of infinite game into finite one is suggested. The conversion is fulfilled in three stages. Primarily the players’ payoff functions are sampled variously according to the stated requirements to the sampling. These functions are defined on unit hypercube of th...
متن کاملOn Loss Aversion in Bimatrix Games
In this article three different types of loss aversion equilibria in bimatrix games are studied. Loss aversion equilibria are Nash equilibria of games where players are loss averse and where the reference points—points below which they consider payoffs to be losses— are endogenous to the equilibrium calculation. The first type is the fixed point loss aversion equilibrium, introduced in Shalev (...
متن کامل